منابع مشابه
Error-Sensitive Proof-Labeling Schemes
Proof-labeling schemes are known mechanisms providing nodes of networks with certificates that can be verified locally by distributed algorithms. Given a boolean predicate on network states, such schemes enable to check whether the predicate is satisfied by the actual state of the network, by having nodes interacting with their neighbors only. Proof-labeling schemes are typically designed for e...
متن کاملProof Labeling Schemes ∗ Amos Korman
This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...
متن کاملOn Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms
It follows from the definition of silent self-stabilization, and from the definition of proof-labeling scheme, that if there exists a silent self-stabilizing algorithm using `-bit registers for solving a task T , then there exists a proof-labeling scheme for T using registers of at most ` bits. The first result in this paper is the converse to this statement. We show that if there exists a proo...
متن کاملProof-Labeling Schemes: Broadcast, Unicast and in Between
We study the effect of limiting the number of different messages a node can transmit simultaneously on the verification complexity of proof-labeling schemes (PLS). In a PLS, each node is given a label, and the goal is to verify, by exchanging messages over each link in each direction, that a certain global predicate is satisfied by the system configuration. We consider a single parameter r that...
متن کاملLabeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any two vertices u and v for some function f (e.g. “distance(u, v)”) one can compute the function (e.g. the graph distance between u and v). Some very involved lower bounds for the sizes of the labels were proven. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2018
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-018-0340-8